Informatics Publishing Limited

N. Kannaiya Raja ¹, K. Arulanandam ², B. Raja Rajeswari ³

Affiliations
1 Department of CSE, Arulmigu Meenakshi Amman College of Engg, Thiruvannamalai Dt., Near Kanchipuram, IN
2 Department of CSE, Ganadipathy Tulsi's Jain Engineering College, Vellore, IN
3 Arulmigu Meenakshi Amman College of Engg, Thiruvannamalai Dt., Near Kanchipuram, IN

Abstract

The network equipment has capable of inspecting packets in order to discover the worms and virus over the network. Many network users are hacked by attackers through malicious functions are mapped on network applications. Such unauthorized activities are required to delete by deep packet inspection in application layer. The high level network equipment provides in-depth packet inspection through pattern matching in network detection system. Researchers have developed high performance parallel deep packet filters for reconfigurable devices. Although some reconfigurable systems can be generated automatically from pattern database, obtaining high performance result from each subsequent reconfiguration can be a time consuming process. By presenting a novel architecture for programmable centralized parallel pattern matching algorithm for efficient packet inspection with network processor and coprocessor in order to retrieve the pattern with less time. Produce a hybrid system that is able to update the rules immediate during the time the new filter is being compiled reduction of resource-intensive task and increasing bandwidth used snort rule. We mapped our centralized multi parallel pattern matching algorithm [CNMPPMA] for filter packet in parallel. The simulation result reveals that CNMPPMA significantly improves the matching performance. Also achieves the matching process with less cost.

Keywords

Intrusion Detection, Network Security, Pattern Matching, Packet Inspection.

Full Text

     

N. Kannaiya Raja ¹, K. Arulanandam ², R. Prabhu ³

Affiliations
1 CSE Department, Arulmigu Meenakshi Amman College of Engineering, Thiruvannamalai district, Near Kanchipuram, IN
2 CSE Department, Ganadipathy Tulsi’s Jain Engineering College, Vellore, IN
3 Arulmigu Meenakshi Amman College of Engineering, Thiruvannamalai District, Near Kanchipuram, IN

Abstract

Multi-pattern string matching remains a major performance bottleneck in network intrusion detection and anti-virus systems for high-speed deep packet inspection (DPI). Although Aho-Corasick deterministic finite automaton (AC- DFA) based solutions produce deterministic throughput and are widely used in today's DPI systems such as Snort and ClamAV, the high memory requirement of AC-DFA (due to the large number of state transitions in AC-DFA) inhibits efficient hardware implementation to achieve high performance.. Novel and scalable pipeline architecture for memory- efficient multi-pattern string matching is then presented. The architecture can be easily extended to support multi-character input per clock cycle by mapping a compressed AC-DFA onto multiple pipelines. In this paper the architecture to support enhanced multi-character input per clock cycle to achieve multiplicative throughput improvement. By using multi pipelining Now we can use the efficient architecture also available to support much larger pattern sets by using a limited number of external memory and also work done integrating proposed string matching architecture with DPI processing engine such packet header and other flags with regular expressing. Very fast regular expression matching is currently used here for applications searching for large pattern sets with increasingly faster data streams and minimize the through put by pipelining process and comparing him high level to reduce the state and minimize the throughput.

Keywords

Deep Packet Inspection, DFA, FPGA, Pipeline, String Matching.

Full Text

     

N. Kannaiya Raja ¹, K. Arulanandam ², R. Radha Krishnan ³, M. Nataraj ⁴

Affiliations
1 Department of CSE, Arulmigu Meenakshi Amman College of Engg., Thiruvannamalai Dt., Near Kanchipuram, IN
2 Department of CSE, Ganadipathy Tulsi's Jain Engineering College, Vellore, IN
3 Sri Chandrasekharendra Saraswathi Viswa Mahavidyalaya University, IN
4 Department of Computer Science and Engineering, Anna University, IN

Abstract

In this research, we consider the problems of registering multiple video sequences dynamic scenes which are not limited non rigid objects such as fireworks, blasting, high speed car moving taken from different vantage points. In this paper we propose a simple algorithm we can create different frames on particular videos moving for matching such complex scenes. Our algorithm does not require the cameras to be synchronized, and is not based on frame-by-frame or volume-by-volume registration. Instead, we model each video as the output of a linear dynamical system and transform the task of registering the video sequences to that of registering the parameters of the corresponding dynamical models. In this paper we use of a joint frame together to form distinct frame concurrently. The joint identification and the Jordan canonical form are not only applicable to the case of registering video sequences, but also to the entire genre of algorithms based on the dynamic texture model. We have also shown that out of all the possible choices for the method of identification and canonical form, the JID using JCF performs the best.

Keywords

Dynamic Textures, Video Registration, Nonrigid Dynamical Scenes.

Full Text

     

N. Kannaiya Raja ¹, K. Arulanandam ², R. Somasundaram ³

Affiliations
1 CSE Department, Arulmigu Meenakshi Amman College of Engineering, Thiruvannamalai Dt, Near Kanchipuram, IN
2 CSE Department, Ganadipathy Tulsi's Jain Engineering College, Vellore, IN
3 Arulmigu Meenakshi Amman College of Engineering, Thiruvannamalai Dt, Near Kanchipuram, IN

Abstract

Fingerprint system use in the pixel system for interacting to the problem of many fields. In this fingerprint system has generally represented by four schemes:grayscale image, phase image, skeleton image, and minutiae scheme which are used in this paper to find out spurious minutiae in the fingerprint. Most of the fingerprint reconstruction schemes has been existed which based on converting minutiae representation to phase (continuous phase and spiral phase). But this still contain a few spurious minutiae especially in high curvature region. For a direct use of the existing reconstruction algorithm to a latent fingerprint in NIST SD27. Both the ridge flow and minutiae in the reconstructed fingerprint match the original fingerprint well. But, apparently, the reconstructed ridge pattern does not match the original ridge skeleton exactly. This novel reconstruction method proposed the difficult and important problem of latent fingerprint restoration using significantly modified existing reconstruction algorithm to make the reconstructed fingerprints appear visually more realistic, brightness, ridge thickness, pores, and noise should be modeled. The accept rate of the reconstructed fingerprints can be further enhance by reducing the image quality around the spurious minutiae in the grayscale image and other features (such as ridge orientation and skeleton) manually marked by the latent expert.

Keywords

Reconstruction, Enhancement, Minutiae, Ridge Matching, Curve Matching.

Full Text

     

N. Kannaiya Raja ¹, K. Arulanandam ², G. Deepa ¹, M. Balaji ³

Affiliations
1 CSE Department, Arulmigu Meenakshi Amman College of Engineering, Thiruvannamalai Dt, Near Kanchipuram, IN
2 CSE Department, Ganadipathy Tulsi’s Jain Engineering College, Vellore, IN
3 Arulmigu Meenakshi Amman College of Engineering, Thiruvannamalai Dt, Near Kanchipuram, IN

Abstract

One way to protect organizations from malware is to deploy high-speed network based intrusion detection systems on the communication lines. This approach is achieved by P-DPL. Such appliances perform deep-packet inspection in real- time and use simple signatures for detecting and removing attacks such as malware, propagating worms, denial-of-service, or remote exploitation of vulnerabilities. P-DPL is primarily intended for high-speed network traffic filtering devices that are based on deep-packet inspection. Malicious executables are analyzed using two approaches: disassembly, utilizing IDA-Pro, and the application of a dedicated state machine in order to obtain the set of functions comprising the executables. The signature extraction process is based on a comparison with a common function repository. By eliminating functions appearing in the common function repository from the signature candidate list, P-DPL can minimize the risk of false-positive detection errors. To minimize false-positive rates even further, P-DPL proposes intelligent candidate selection using an entropy score to generate signatures.

Keywords

Automatic Signature Generation (ASG), Malware, Malware Filtering, Packet-Deployment Payload (P-DPL).

Full Text

     

N. Kannaiya Raja ¹, K. Arulanandam ², S. K. Sugunedham ³

Affiliations
1 CSE Department, Arulmigu Meenakshi Amman College of Engineering, Thiruvannamalai Dt, Near Kanchipuram, IN
2 CSE Department, Ganadipathy Tulsi’s Jain Engineering College, Vellore, IN
3 CSE Department, Arulmigu Meenakshi Amman College of Engineering, Thiruvannamalai Dt, Near Kanchipuram, IN

Abstract

In this work we present a novel approach that uses interspecies sequences homology to connect the networks of multi species and possible more species and possible more species together with gene ontology dependencies in order to improve protein classification for research work. Proteins are involved in many for all biological process such energy metabolism, signal transduction and translation initiation. Even though for a large portion of proteins and their biological function are unknown or incomplete, therefore constructing efficient and reliable models for predicting the protein function has to be used in research work. Our method readily extends to multi species food and produce the improvements similar to them multi species. In the presence of multi interacting networks are using data mining for integration of a data from various sources and contributing increased accuracy of the function prediction of the multiple species for research work. We further enhance our model to account for the gene ontology dependencies by linking multiple related ontology categories such as, we have selected the food items from various countries such as from America the famous food items of yoghurt and Australia food items of oats and Indian food items of soya bean. The data sets are highly desirable for this use from various countries using logical networks from center for bioinformatics research institute (Chennai) and stored in the mining. SFLA aims to set a generic paradism of the efficient mining that acquire the data set of proteins for these food items and promotes predictions of protein functions with gene ontology for research work.

Keywords

Biology and Genetics, Machine Learning, Bioinformatics (Genome or Protein) Databases.

Full Text

     

N. Kannaiya Raja ¹, R. Somasundaram ², K. Arulanandam ³

Affiliations
1 CSE Department, Arulmigu Meenakshi Amman College of Engineering, Thiruvannamalai District, Near Kanchipuram, IN
2 Arulmigu Meenakshi Amman College of Engineering, Thiruvannamalai District, Near Kanchipuram, IN
3 CSE Department, Ganadipathy Tulsi's Jain Engineering College, Vellore, IN

Abstract

Fingerprint system use in the pixel system for interacting to the problem of many fields. In this fingerprint system has generally represented by four schemes: grayscale image, phase image, skeleton image, and minutiae scheme which are used in this paper to find out spurious minutiae in the fingerprint. Most of the fingerprint reconstruction schemes has been existed which based on converting minutiae representation to phase (continuous phase and spiral phase).but this still contain a few spurious minutiae especially in high curvature region. For a direct use of the existing reconstruction algorithm to a latent fingerprint in NIST SD27. Both the ridge flow and minutiae in the reconstructed fingerprint match the original fingerprint well. But, apparently, the reconstructed ridge pattern does not match the original ridge skeleton exactly. This novel reconstruction method proposed the difficult and important problem of latent fingerprint restoration using significantly modified existing reconstruction algorithm to make the reconstructed fingerprints appear visually more realistic, brightness, ridge thickness, pores, and noise should be modeled. The accept rate of the reconstructed fingerprints can be further enhance by reducing the image quality around the spurious minutiae in the grayscale image and other features (such as ridge orientation and skeleton) manually marked by the latent expert.

Keywords

Reconstruction, Enhancement, Minutiae, Ridge Matching, Curve Matching.

Full Text

     

D. Jasmine Priskilla ¹, K. Arulanandam ²

Affiliations
1 Bharathiar University, Coimbatore – 641046, Tamil Nadu, IN
2 Department of Computer Applications, GTM College, Gudiyattam – 632604, TamilNadu, IN

Abstract

Consider a directed weight graph G = (V, E) with n vertices and m edges. A directed minimum cost spanning tree of a weighted graph is a tree of the graph which contains all the vertices of the graph and the sum of weights of all its edges are minimum among all such possible trees of the directed graph. In this paper, I have proposed a new technique and its equivalent algorithm to construct the directed minimum cost spanning tree of a weight graph. This new algorithm is based on the weight matrix of a weighted graph. The input of the proposed algorithm is the weight matrix M, which consist n2 elements of directed weight graph G. The output of the algorithm is Directed Minimum Cost Spanning Tree. The best case time complexity will be in order of O(m), where m = n-1. The worst case time complexity will be in order of O(m2), where m = n-1.

Keywords

Directed Graph, Directed Minimum Cost Spanning Tree, Spanning Tree

Full Text

   

P. Daniel Sundarraj ¹, K. Arulanandam ²

Affiliations
1 Department of Computer Science, Thiruvalluvar University, IN
2 Department of Computer Science, Government Thirumagal Mills College, IN

Abstract

Mobile Ad-Hoc Network (MANET) is a generic technology utilized in various real-time applications. The MANET is a self-configuring and self-directed system that quickly deploys in a network. Data transfer is a big issue in MANET due to poor wireless medium and lack of data security and reliability. The prior system established a mobile ad hoc content distribution strategy. The ideal Cluster Head (CH) is chosen using the Teaching Learning Based Optimization (TLBO) approach. However, due to these features, it is more vulnerable to attacks. In addition, it impacts packet delivery and throughput. The proposed system designed a Secure and Energy Aware Routing (SEAR) mechanism to improve MANET data transmission reliability and security. Initially, nodes are clustered by distance. Then the Weightbased Artificial Fish Swarm Algorithm (WAFSA) is used to pick the optimum Cluster Head (CH). Mobility, remaining energy, and connectivity are considered objective functions for CH selection. Securing communication between these nodes will require proper cryptography. The security mechanism generates secret keys using Advanced Encryption Standard (AES) to encrypt or decode messages delivered between member nodes. This security approach enables secure communication between member nodes and CHs, uses the NS2 analytical platform, and outperforms the existing system regarding average energy drop, network lifetime, and encryption time.

Keywords

Cluster Head (CH), Advanced Encryption Standard (AES), Weightbased Artificial Fish Swarm Algorithm (WAFSA), Secret Keys

Full Text